Graphs with largest number of minimum cuts
نویسندگان
چکیده
منابع مشابه
Envy-Free Mechanisms with Minimum Number of Cuts
We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players in a way that meets the following criteria: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the mechanism is strategy-proof (truthful), and (III) ...
متن کاملGlobal minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in gO(g)n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Łącki and Sankowski, for any constant g. Indeed, our algorithm calls Ł...
متن کاملGraphs with the second largest number of maximal independent sets
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. Erdős and Moser raised the problem of determining the maximum value of mi(G) among all graphs of order n and the extremal graphs achieving this maximum value. This problem was solved by Moon and Moser. Then it was studied for many special classes of grap...
متن کاملBounds on the Largest of Minimum Degree Eigenvalues of Graphs
Let G be a simple graph and let its vertex set be V (G) = {v1, v2, ..., vn}. The adjacency matrix A(G) of the graph G is a square matrix of order n whose (i, j)-entry is equal to unity if the vertices vi and vj are adjacent, and is equal to zero otherwise. The eigenvalues λ1, λ2, ..., λn of A(G), assumed in non increasing order, are the eigenvalues of the graph G. The energy of G was first defi...
متن کاملOn the Number of Minimum Cuts in a Graph
We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we provide upper bounds for the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, girth, and some other parameters of the graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00043-q